The Positive and Generalized Discriminators Don’t Exist1
نویسنده
چکیده
In this paper it is proved that there does not exist a function for the language of positive and generalized conditional terms that behaves the same as the discriminator for the language of conditional terms.
منابع مشابه
Generic top-down discrimination for sorting and partitioning in linear time
We introduce the notion of discrimination as a generalization of both sorting and partitioning and show that discriminators (discrimination functions) can be defined generically, by structural recursion on representations of ordering and equivalence relations. Discriminators improve the asymptotic performance of generic comparison-based sorting and partitioning, and can be implemented not to ex...
متن کاملGeneric Discrimination: Partitioning and Sorting of Complex Data in Linear Time
We introduce the notion of discrimination, which is a generalized form of partitioning, and present an expressive term language for defining equivalence relations on complex data. The language allows definition of equivalence relations by freely combining structural equivalence, equivalence of lists under commutativity, idempotence (bag and set equivalence), and more. We then show that worst-ca...
متن کاملGeneric Top-down Discrimination∗
We introduce the notion of discrimination as a generalization of both sorting and partitioning and show that discriminators (discrimination functions) can be defined generically, by structural recursion on order and equivalence expressions denoting a rich class of total preorders and equivalence relations, respectively. Discriminators improve the asymptotic performance of generic comparison-bas...
متن کاملA 76 INTEGERS 16 ( 2016 ) DISCRIMINATORS AND k - REGULAR SEQUENCES
The discriminator of an integer sequence s = (s(i))i 0, introduced by Arnold, Benkoski, and McCabe in 1985, is the map Ds(n) that sends n 1 to the least positive integer m such that the n numbers s(0), s(1), . . . , s(n 1) are pairwise incongruent modulo m. In this note we consider the discriminators of a certain class of sequences, the k-regular sequences. We compute the discriminators of two ...
متن کاملA Class of Exponential Sequences with Shift-Invariant Discriminators
The discriminator of an integer sequence s = (s(i))i≥0, introduced by Arnold, Benkoski, and McCabe in 1985, is the function Ds(n) that sends n to the least integer m such that the numbers s(0), s(1), . . . , s(n−1) are pairwise incongruent modulo m. In this note we present a class of exponential sequences that have the special property that their discriminators are shift-invariant, i.e., that t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001